quadratic constraint - définition. Qu'est-ce que quadratic constraint
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est quadratic constraint - définition

MATHEMATICAL CONCEPT
Quadratic surd; Quadratic irrationality; Quadratic Irrational Number; Quadratic irrationalities; Quadratic irrational; Quadratic irrational numbers

Quadratic irrational number         
In mathematics, a quadratic irrational number (also known as a quadratic irrational, a quadratic irrationality or quadratic surd) is an irrational number that is the solution to some quadratic equation with rational coefficients which is irreducible over the rational numbers.Jörn Steuding, Diophantine Analysis, (2005), Chapman & Hall, p.
Constraint (computational chemistry)         
  • Resolving the constraints of a rigid water molecule using [[Lagrange multipliers]]: a) the unconstrained positions are obtained after a simulation time-step, b) the [[gradients]] of each constraint over each particle are computed and c) the Lagrange multipliers are computed for each gradient such that the constraints are satisfied.
METHOD FOR SATISFYING THE NEWTONIAN MOTION OF A RIGID BODY WHICH CONSISTS OF MASS POINTS
SHAKE (constraint); SETTLE (constraint); LINCS (constraint); Constraint algorithm (mechanics); SHAKE algorithm; Simple constraint; M-SHAKE; SETTLE (algorithm); SETTLE; Constraint algorithm
In computational chemistry, a constraint algorithm is a method for satisfying the Newtonian motion of a rigid body which consists of mass points. A restraint algorithm is used to ensure that the distance between mass points is maintained.
Quadratic reciprocity         
THEOREM
Law of quadratic reciprocity; Quadratic reciprocity rule; Aureum Theorema; Law of Quadratic Reciprocity; Quadratic reciprocity law; Quadratic reciprocity theorem; Quadratic Reciprocity; Qr theorem
In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is:

Wikipédia

Quadratic irrational number

In mathematics, a quadratic irrational number (also known as a quadratic irrational, a quadratic irrationality or quadratic surd) is an irrational number that is the solution to some quadratic equation with rational coefficients which is irreducible over the rational numbers. Since fractions in the coefficients of a quadratic equation can be cleared by multiplying both sides by their least common denominator, a quadratic irrational is an irrational root of some quadratic equation with integer coefficients. The quadratic irrational numbers, a subset of the complex numbers, are algebraic numbers of degree 2, and can therefore be expressed as

a + b c d , {\displaystyle {a+b{\sqrt {c}} \over d},}

for integers a, b, c, d; with b, c and d non-zero, and with c square-free. When c is positive, we get real quadratic irrational numbers, while a negative c gives complex quadratic irrational numbers which are not real numbers. This defines an injection from the quadratic irrationals to quadruples of integers, so their cardinality is at most countable; since on the other hand every square root of a prime number is a distinct quadratic irrational, and there are countably many prime numbers, they are at least countable; hence the quadratic irrationals are a countable set.

Quadratic irrationals are used in field theory to construct field extensions of the field of rational numbers Q. Given the square-free integer c, the augmentation of Q by quadratic irrationals using c produces a quadratic field Q(c). For example, the inverses of elements of Q(c) are of the same form as the above algebraic numbers:

d a + b c = a d b d c a 2 b 2 c . {\displaystyle {d \over a+b{\sqrt {c}}}={ad-bd{\sqrt {c}} \over a^{2}-b^{2}c}.}

Quadratic irrationals have useful properties, especially in relation to continued fractions, where we have the result that all real quadratic irrationals, and only real quadratic irrationals, have periodic continued fraction forms. For example

3 = 1.732 = [ 1 ; 1 , 2 , 1 , 2 , 1 , 2 , ] {\displaystyle {\sqrt {3}}=1.732\ldots =[1;1,2,1,2,1,2,\ldots ]}

The periodic continued fractions can be placed in one-to-one correspondence with the rational numbers. The correspondence is explicitly provided by Minkowski's question mark function, and an explicit construction is given in that article. It is entirely analogous to the correspondence between rational numbers and strings of binary digits that have an eventually-repeating tail, which is also provided by the question mark function. Such repeating sequences correspond to periodic orbits of the dyadic transformation (for the binary digits) and the Gauss map h ( x ) = 1 / x 1 / x {\displaystyle h(x)=1/x-\lfloor 1/x\rfloor } for continued fractions.